Annales UMCS Informatica AI
نویسنده
چکیده
The studies of Church’s thesis (further denoted as CT) are slowly gaining their intensity. Since different formulations of the thesis are being proposed, it is necessary to state how it should be understood. The following is the formulation given by Church: [CT] The concept of the effectively calculable function is identical with the concept of the recursive function. The conviction that the above formulation is correct, finds its confirmation in Church’s own words: We now define the notion, [...] of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers [...]. Frege thought that the material equivalence of concepts is the approximation of their identity. For any concepts F, G: Concept F is identical with concept G iff ∀x (Fx ≡ Gx) . The symbol Fx should be read as “object x falls under the concept F”. The contemporary understanding of the right side of the above equation was dominated by the first order logic and set theory.
منابع مشابه
Annales UMCS Informatica AI 7 ( 2007 ) 37 - 47 Annales UMCS Informatica
In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...
متن کاملGalton Board with memory
The Galton Board model complemented with a simple memory mechanism was employed to illustrate the Galton Table structure
متن کاملAutomatic Keyphrase Extraction
Increasing number of documents in the Web caused the growth of needs for tools supporting automatic search and classification of texts.
متن کاملIntegrated education system
In this paper we present the Lecta integrated education system. We show general assumptions of the system and we describe modules of Lecta. System programming platform, teaching aspect and exam module “Lecta-Egzaminator” are presented in detail.
متن کاملTwo hierarchies of R-recursive functions
In the paper some aspects of complexity of R-recursive functions are considered. The limit hierarchy of R-recursive functions is introduced by the analogy to the μ-hierarchy. Then its properties and relations to the μ-hierarchy are analysed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017